|
Membrane systems have been inspired from the structure and the functioning of the living cells. They were introduced and studied by Gh.Paun under the name of P systems (); some applications of the membrane systems are presented in (). Membrane systems are essentially models of distributed, parallel and nondeterministic systems. Here we motivate and present the mobile membranes. Mobile membranes represent a variant of membrane systems inspired by the biological movements given by endocytosis and exocytosis. They have the expressive power of both P systems and process calculi with mobility such as mobile ambients () and brane calculi (). Computations with mobile membranes can be defined over specific configurations (like process calculi), while they represent also a rule-based formalism (like P systems). The model is characterized by two essential features: * A spatial structure consisting of a hierarchy of membranes (which do not intersect) with objects associated to them. A membrane without any other membranes inside is called elementary. * The general rules describing the evolution of the structure: endocytosis (moving an elementary membrane inside a neighbouring membrane) and exocytosis (moving an elementary membrane outside the membrane where it is placed). More specific rules are given by pinocytosis (engulfing zero external membranes) and phagocytosis (engulfing just one external elementary membrane). The computations are performed in the following way: starting from an initial structure, the system evolves by applying the rules in a nondeterministic and maximally parallel manner. A rule is applicable when all the involved objects and membranes appearing in its left hand side are available. The maximally parallel way of using the rules means that in each step a maximal multiset of rules is applied, namely a multiset of rules such that no further rule can be added to the set. A halting configuration is reached when no rule is applicable. The result is represented by the number of objects associated to a specified membrane. Mobile membranes represents a formalism which describes the movement of membranes inside a spatial structure by applying rules from a given set of rules . The mobility is provided by consumption and rewriting of objects. In terms of computation, the work is performed using membrane configurations. A the set of membrane configurations (ranged by ) os defined by using the free monoid (ranged over by ) generated by a finite alphabet (ranged over by ): If and are two membrane configurations, reduces to (denoted by ) if there exists a rule in the set of rules applicable to the configuration such that the new configuration is obtained. When applying the rules of , also the following inference rules are used: ; When describing a computation of a systems of mobile membranes, an initial configuration and a set of rules are given. The rules used in this paper describe an (object rewriting), movement (moving an elementary membrane inside a neighbouring membrane), movement (moving an elementary membrane outside the membrane where it is placed), (engulfing zero external membranes), and (engulfing just one external elementary membrane). ==Computability Power of Mobile Membranes== A specific feature of the mobile membranes is that this new rule-based model is appropriate to prove computability results in terms of Turing machines rather by reduction to the lambda calculus as in the case of process calculi with mobility. In this section are defined four classes of membranes inspired from biological facts, and it is showed that their computational power depends on the initial configuration and on the set of rules used. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Mobile Membranes」の詳細全文を読む スポンサード リンク
|